Graph Kernel Based Clustering Algorithm in MANETs
نویسندگان
چکیده
منابع مشابه
Probability Based Adaptive Invoked Clustering Algorithm in MANETs
A mobile ad hoc network (MANET), is a self-configuring network of mobile devices connected by wireless links. In order to achieve stable clusters, the cluster-heads maintaining the cluster should be stable with minimum overhead of cluster re-elections. In this paper we propose a Probability Based Adaptive Invoked Weighted Clustering Algorithm (PAIWCA) which can enhance the stability of the clus...
متن کاملClustering Algorithm for MANETs based on mobility prediction
In mobile ad hoc networks (MANETs), the network topology is autonomously formed and continuously changes, due to the mobility of the nodes. Clustering allows us to organize the topology in a structured manner. The association and dissociation of nodes to and from clusters perturb the stability of the network topology, and hence reconfiguration of the system is often unavoidable. Several existin...
متن کاملFuzzy Logic-based Mobility Metric Clustering Algorithm for MANETs
Mobile ad-hoc network, (MANET) is a collection of wireless mobile nodes dynamically forming a temporary communication network without using any existing infrastructure or centralized administration. To reduce routing overhead, computational complexity and overcome the problem of low bandwidth utilization, MANET is divided into several clusters. The authors propose a fuzzy logic based mobility m...
متن کاملFast Algorithm for Modularity-Based Graph Clustering
In AI and Web communities, modularity-based graph clustering algorithms are being applied to various applications. However, existing algorithms are not applied to large graphs because they have to scan all vertices/edges iteratively. The goal of this paper is to efficiently compute clusters with high modularity from extremely large graphs with more than a few billion edges. The heart of our sol...
متن کاملGraph Nodes Clustering Based on the Commute-Time Kernel
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel (KCT), providing a similarity measure between any couple of nodes by taking the indirect links into account, is computed from the adjacency matrix of the graph. Then, the nodes of the graph are clustered by performin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3001137